MDEC: MeTiS-based Domain Decomposition for Parallel 2D Mesh Generation
نویسندگان
چکیده
Domain decomposition methods are commonly employed within the context of parallel numerical algorithms. Most often, the domain decomposition is performed before the main computation begins. Within the context of mesh generation, parallel mesh generation is desired when the goal is to mesh a very large geometric domain or if very high accuracy is required. In this paper, we propose a novel technique, which we call the MeTiS-based Domain Decomposition (MDEC) technique, for the decomposition of geometric domains into subdomains for use in parallel 2D mesh generation. Our technique is based upon discrete domain decomposition [1]. The algorithm proceeds by first constructing a background mesh which satisfies a minimum angle constraint of 30 degrees and second partitioning this initial coarse mesh or background mesh into subdomains. Finally, adjustments are applied to the triangles with small boundary angles so that all subdomains in the final decomposition contain boundary angles no smaller than 60 degrees which is a guaranteed property of the domain decomposition algorithm. We prove this guarantee for the boundary angles of the MDEC domain decomposition. Our results show that, in comparison to the medial axis domain decomposition (MADD) algorithm [2], our method provides a better balance of subdomain areas, better boundary angles, and a faster decomposition time. In addition, when the MDEC and MADD subdomains are used in conjunction with a parallel constained Delaunay mesh generation technique (PCDM) [3], the meshes are generated in approximately the same time and have very similar element quality.
منابع مشابه
Tool-box for parallel adaptive computations of 3-D convection-diffusion problems using domain decomposition
In this report we describe the tools that we have used, developed, and implemented in a computer system for simulation of flows in porous media. Our goal was to create a simulator that uses various tools and that is based on discretization by finite elements and finite volumes and uses efficient preconditioning iterative methods for the resulting large sparse system. Also important features are...
متن کاملDecoupling Method for Parallel Delaunay 2D Mesh Generation
PAGE Meshes are central structures for numerical methods, such as the finite element method. These numerical methods require high quality refined meshes in order to achieve good approximations of the analytical model. Unstructured meshes are the most popular; their adaptive nature allows them to give boundary conforming meshes of good quality, with optimal size. The most widely studied 2D mesh ...
متن کاملEvaluation of Parallel Domain Decomposition Algorithms
In this talk we describe and evaluate several heuristics for the parallel decomposition of data into n processors. This problem is usually cast as a graph partitioning problem, requiring that each processor have equal amount of data, and that inter-processor communication be minimized. Since this problem is NP-complete, several heuristics have been developed: combinatorial, geometric, spectral,...
متن کاملParallel unstructured mesh generation by an advancing front method
Mesh generation is a critical step in high fidelity computational simulations. High quality and high density meshes are required to accurately capture the complex physical phenomena. A parallel framework has been developed to generate large-scale meshes in a short period of time. A coarse volume mesh is generated first to provide the basis of block interfaces and partitioned into a number of su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011